Solving large-scale mixed-integer programs with fixed charge variablesSUHL, U. H.Mathematical programming. 1985, Vol 32, Num 2, pp 165-182, issn 0025-5610Article

A simple algorithm for solving small, fixed-charge transportation problemsSANDROCK, K.The Journal of the Operational Research Society. 1988, Vol 39, Num 5, pp 467-475, issn 0160-5682Article

A VERTEX RANKING PROCEDURE FOR SOLVING THE LINEAR FIXED-CHARGE PROBLEM.MCKEOWN P.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 6; PP. 1183-1191; BIBL. 9 REF.Article

A NEW BRANCH-AND -BOUND ALGORITHM FOR THE FIXED-CHARGE TRANSPORTATION PROBLEM.KENNINGTON J; UNGER E.1976; MANAG. SCI.; U.S.A.; DA. 1976; VOL. 22; NO 10; PP. 1116-1126; BIBL. 1 P.Article

A STUDY OF THE FIXED CHARGE TRANSPORTATION PROBLEM.ROBERS P; COOPER L.1976; COMPUTERS MATH. APPL.; G.B.; DA. 1976; VOL. 2; NO 2; PP. 125-135; BIBL. 4 REF.Article

THE FIXED CHARGE PROBLEM. I. A NEW HEURISTIC METHOD.COOPER L.1975; COMPUTERS MATH. APPL.; G.B.; DA. 1975; VOL. 1; NO 1; PP. 89-95; BIBL. 10 REF.Article

On the fixed-charge transportation problemADLAKHA, V; KOWALSKI, K.Omega (Oxford). 1999, Vol 27, Num 3, pp 381-388, issn 0305-0483Article

Valid linear inequalities for fixed charge problemsPADBERG, M. W; VAN ROY, T. J; WOLSEY, L. A et al.Operations research. 1985, Vol 33, Num 4, pp 842-861, issn 0030-364XArticle

A computational study of using preprocessing and stronger formulations to solve large general fixed charge problemsMCKEOWN, P. G; RAGSDALE, C. T.Computers & operations research. 1989, Vol 17, Num 1, pp 9-16, issn 0305-0548, 8 p.Article

ADJACENT VERTICES ON TRANSPORTATION POLYTOPES.MCKEOWN PG; RUBIN DS.1975; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1975; VOL. 22; NO 2; PP. 365-374; BIBL. 11 REF.Article

A SYSTEMATIC EXTREME POINT ENUMERATION PROCEDURE FOR FIXED CHARGE PROBLEM.PURI MC; KANTI SWARUP.1974; TRAB. ESTADIST. INVEST. OPER.; ESP.; DA. 1974; VOL. 25; NO 1-2; PP. 99-108; BIBL. 1 P.Article

A BRANCH-AND-BOUND ALGORITHM FOR SOLVING FIXED CHARGE PROBLEMSMCKEOWN PG.1981; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 4; PP. 607-617; BIBL. 15 REF.Article

A MORE COMPACT FORMULATION OF THE SYMMETRIC MULTIPLE TRAVELLING SALESMAN PROBLEM WITH FIXED CHARGESDISCENZA JH.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 73-75; BIBL. 1 REF.Article

A NOTE ON THE MULTIPLE TRAVELING SALESMEN PROBLEMRAO MR.1980; OPER. RES.; USA; DA. 1980; VOL. 28; NO 3; PART. 1; PP. 628-632; BIBL. 2 REF.Article

A VERTEX RANKING ALGORITHM FOR THE FIXED-CHARGE TRANSPORTATION PROBLEMSADAGOPAN S; RAVINDRAN A.1982; J. OPTIM. THEORY APPL.; ISSN 0022-3239; USA; DA. 1982; VOL. 37; NO 2; PP. 221-230; BIBL. 14 REF.Article

DESIGN OF A RECEIVABLE COLLECTION SYSTEM: SEQUENTIAL BUILDING HEURISTICSSTONE BK.1981; MANAGE. SCI.; ISSN 0025-1909; USA; DA. 1981; VOL. 27; NO 8; PP. 866-880; BIBL. 21 REF.Article

A NOTE ON THE SYMMETRIC MULTIPLE TRAVELING SALESMAN PROBLEM WITH FIXED CHARGES.HONG S; PADBERG MW.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 5; PP. 871-874; BIBL. 3 REF.Article

A comparison of two representations for the fixed charge transportation problemGOTTLIEB, Jens; ECKERT, Christoph.Lecture notes in computer science. 2000, pp 345-354, issn 0302-9743, isbn 3-540-41056-2Conference Paper

The family constrained network problemMOTE, J.Discrete applied mathematics. 1986, Vol 13, Num 2-3, pp 249-257, issn 0166-218XArticle

A simple heuristic for solving small fixed-charge transportation problemsADLAKHA, Veena; KOWALSKI, Krzysztof.Omega (Oxford). 2003, Vol 31, Num 3, pp 205-211, issn 0305-0483, 7 p.Article

Geometric comparison of combinatorial polytopesLEE, J; MORRIS, W. D.Discrete applied mathematics. 1994, Vol 55, Num 2, pp 163-182, issn 0166-218XArticle

Exact algorithm for solving a special fixed-charge linear programming problemHABERL, J.Journal of optimization theory and applications. 1991, Vol 69, Num 3, pp 489-529, issn 0022-3239Article

Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problemsRARDIN, R. L; WOLSEY, L. A.European journal of operational research. 1993, Vol 71, Num 1, pp 95-109, issn 0377-2217Article

A set covering reformulation of the pure fixed charge transportation problemGÖTHE-LUNDGREN, M; LARSSON, T.Discrete applied mathematics. 1994, Vol 48, Num 3, pp 245-259, issn 0166-218XConference Paper

A branch-and-bound method for the fixed charge transportation problemPALEKAR, U. S; KARWAN, M. H; ZIONTS, S et al.Management science. 1990, Vol 36, Num 9, pp 1092-1105, issn 0025-1909, 14 p.Article